Generating Random Factored Ideals in Number Fields
نویسنده
چکیده
We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can produce a random ideal in the ring of algebraic integers uniformly at random among ideals with norm up to N , in polynomial time. We also present a variant of this algorithm for generating ideals in function fields.
منابع مشابه
Generating random factored Gaussian integers, easily
We present a (random) polynomial-time algorithm to generate a randomGaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. The method generalizes to finding a random ideal in the ring of integers of a quadratic number field together with its prime ideal factorization. We also discuss the analogous problem for higher degree number fie...
متن کاملG ENERATION OF TRULY RANDOM NUMBERS WITH KNOWN FACTORIZATION ( December 2006 )
The number field sieve of factoring 1024-bit RSA keys has many steps involved, one of them being the ‘relation collection’ step. This step consists of two parts, the first part is called Sieving and is used to generate smooth random numbers (numbers whose factors are less than a given boundary), and these smooth numbers are factored in the second part by special factoring methods like ECM, p-1 ...
متن کامل2 01 7 on the Logarithmic Probability That a Random Integral Ideal Is a - Free
Abstract. This extends a theorem of Davenport and Erdös [7] on sequences of rational integers to sequences of integral ideals in arbitrary number fields K. More precisely, we introduce a logarithmic density for sets of integral ideals in K and provide a formula for the logarithmic density of the set of so-called A -free ideals, i.e. integral ideals that are not multiples of any ideal from a fix...
متن کاملSmooth Ideals in Hyperelliptic Function Fields Smooth Ideals in Hyperelliptic Function Fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over nite elds. Some of them have a provable subexponential running time and are using the fact that smooth reduced ideals are suuciently dense. We explicitly show how these density results can be derived. All proofs are purely combinatorial and do not ...
متن کاملFactoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication
We present novel algorithms to factor polynomials over a finite field Fq of odd characteristic using rank 2 Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial f(x) ∈ Fq[x] to be factored) with respect to a Drinfeld module φ with complex multiplication. Factors of f(x) supported on prime ideals with supersingular reducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1612.06260 شماره
صفحات -
تاریخ انتشار 2016